Signatures for network coding without random oracles
نویسندگان
چکیده
منابع مشابه
Short Signatures Without Random Oracles
We describe a short signature scheme which is existentially unforgeable under a chosen message attack without using random oracles. The security of our scheme depends on a new complexity assumption we call the Strong Diffie-Hellman assumption. This assumption has similar properties to the Strong RSA assumption, hence the name. Strong RSA was previously used to construct signature schemes withou...
متن کاملEfficient Ring Signatures Without Random Oracles
We describe the first efficient ring signature scheme secure, without random oracles, basedon standard assumptions. Our ring signatures are based in bilinear groups. For l members ofa ring our signatures consist of 2l + 2 group elements and require 2l + 3 pairings to verify. Weprove our scheme secure in the strongest security model proposed by Bender, Katz, and Morselli:namely, ...
متن کاملConcurrent Blind Signatures Without Random Oracles
We present a blind signature scheme that is efficient and provably secure without random oracles under concurrent attacks utilizing only four moves of short communication. The scheme is based on elliptic curve groups for which a bilinear map exists and on extractable and equivocable commitments. The unforgeability of the employed signature scheme is guaranteed by the LRSW assumption while the b...
متن کاملLogarithmic size ring signatures without random oracles
Ring signatures enable a user to anonymously sign a message on behalf of group of users. In this paper, we propose the first ring signature scheme whose size is O(log2N), where N is the number of users in the ring. We achieve this result by improving Chandran et al.’s ring signature scheme presented at ICALP 2007. Our scheme uses a common reference string and non-interactive zero-knowledge proo...
متن کاملEfficient Intrusion-Resilient Signatures Without Random Oracles
Intrusion-resilient signatures are key-evolving protocols that extend the concepts of forward-secure and key-insulated signatures. As in the latter schemes, time is divided into distinct periods where private keys are periodically updated while public keys remain fixed. Private keys are stored in both a user and a base; signature operations are performed by the user while the base is involved i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energy Procedia
سال: 2011
ISSN: 1876-6102
DOI: 10.1016/j.egypro.2011.11.100